Linear rank-width and linear clique-width of trees
نویسندگان
چکیده
منابع مشابه
Linear Rank-Width and Linear Clique-Width of Trees
We show that for every forest T the linear rank-width of T is equal to the path-width of T , and the linear clique-width of T equals the path-width of T plus two, provided that T contains a path of length three. It follows that both linear rank-width and linear clique-width of forests can be computed in linear time. Using our characterization of linear rank-width of forests, we determine the se...
متن کاملGraphs of small bounded linear clique-width
In this paper we give the first characterisation of graphs with linear clique-width at most 3, and we give a polynomial-time recognition algorithm for such graphs. In addition, we give a new characterisation of graphs with linear clique-width at most 2 and a new layout characterisation of linear clique-width in general. Among our results is also a decomposition scheme that preserves the linear ...
متن کاملMinimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...
متن کاملLinear Rank-Width of Distance-Hereditary Graphs
We present a characterization of the linear rank-width of distancehereditary graphs. Using the characterization, we show that the linear rankwidth of every n-vertex distance-hereditary graph can be computed in time O(n · log(n)), and a linear layout witnessing the linear rank-width can be computed with the same time complexity. For our characterization, we combine modifications of canonical spl...
متن کاملLinear Clique-Width for Hereditary Classes of Cographs
• give all vertices labeled i the label j. ∗All three authors were partially supported by EPSRC via the grant EP/J006130/1. †Vatter’s research was also partially supported by the National Security Agency under Grant Number H98230-12-1-0207 and the National Science Foundation under Grant Number DMS-1301692. The United States Government is authorized to reproduce and distribute reprints not-withs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.04.021